A context-free grammar for the Ramanujan-Shor polynomials

Specifying Context free Grammar for Marathi Sentences

Marathi is an Indo-Aryan Language and forms the official language of state of Maharashtra. It is ranked as the 4 most spoken language in India and 15 most spoken language in the world. When Computational Linguistic is concerned, writing grammar production for a language is a bit difficult because of different gender and number forms. This paper is an effort to write context free grammar for Mar...

Structuring Chromosomes for Context-Free Grammar Evolution

This paper investigates the use of genetic algorithms for inferring small regular and context-free grammars. Applied simply, a genetic algorithm is not very effective at this. To overcome this problem we investigate two methods of structuring the chromosomes. The rst is to bias the distribution of`1's in the population of chromosomes according to an algebraic expansion technique previously deve...

Gibbsian Context-Free Grammar for Parsing

Bijections behind the Ramanujan Polynomials

The Ramanujan polynomials were introduced by Ramanujan in his study of power series inversions. In an approach to the Cayley formula on the number of trees, Shor discovers a refined recurrence relation in terms of the number of improper edges, without realizing the connection to the Ramanujan polynomials. On the other hand, Dumont and Ramamonjisoa independently take the grammatical approach to ...

Context-Free Grammar — Part I

The articles [8], [5], [9], [1], [10], [11], [3], [2], [7], [4], and [6] provide the notation and terminology for this paper. We consider tree construction structures as extensions of 1-sorted structure as systems 〈 a carrier, rules 〉, where the carrier is a set and the rules constitute a relation between the carrier and the carrier∗. Let us note that there exists a tree construction structure ...